Approximate algorithms for the competitive facility location problem
نویسندگان
چکیده
منابع مشابه
Approximate Algorithms for the Competitive Facility Location Problem
We consider the competitive facility location problem in which two competing sides (the Leader and the Follower) open in succession their facilities, and each consumer chooses one of the open facilities basing on its own preferences. The problem amounts to choosing the Leader’s facility locations so that to obtain maximal profit taking into account the subsequent facility location by the Follow...
متن کاملSequential Competitive Facility Location Problem in a Discrete Planar Space
In this paper, there are two competitors in a planar market. The first competitor, called, the leader, opens new facilities. After that, the second competitor, the follower, reacts to the leader’s action and opens r new facilities. The leader and the follower have got some facilities in advance in this market. The optimal locations for leader and follower are chosen among predefined candida...
متن کاملApproximate robust optimization for the Connected Facility Location problem
In this paper we consider the Robust Connected Facility Location (ConFL) problem within the robust discrete optimization framework introduced by Bertsimas and Sim [7]. We propose an Approximate Robust Optimization (ARO) method that uses a heuristic and a lower bounding mechanism to rapidly find high-quality solutions. The use of a heuristic and a lower bounding mechanism—as opposed to solving t...
متن کاملSolution of Discrete Competitive Facility Location Problem for Firm Expansion
A new heuristic algorithm for solution of bi-objective discrete competitive facility location problems is developed and experimentally investigated by solving different instances of a facility location problem for firm expansion. The proposed algorithm is based on ranking of candidate locations for the new facilities, where rank values are dynamically adjusted with respect to behaviour of the a...
متن کاملBranch-and-bound algorithm for a competitive facility location problem
We study a mathematical model generalizing the well-known facility location problem. In this model we consider two competing sides successively placing their facilities and aiming to ‘‘capture’’ consumers, in order to make maximal profit. We state the problem as a bilevel integer programming problem, regarding optimal noncooperative solutions as optimal solutions. We propose a branch-andbound a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied and Industrial Mathematics
سال: 2011
ISSN: 1990-4789,1990-4797
DOI: 10.1134/s1990478911020049